Perfect Sampling of GI/GI/c Queues
نویسندگان
چکیده
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multiserver queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling from the past protocol. In particular, we use a coupled multi-server vacation system as the upper bound process and develop an algorithm to simulate the vacation system backwards in time from stationarity at time zero. The algorithm has finite expected termination time with mild moment assumptions on the interarrival time and service time distributions.
منابع مشابه
Simulating Tail Probabilities in GI/GI.1 Queues and Insurance Risk Processes with Sub Exponential Distributions
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The interarrival times can have any distribution with a nite mean. The problem of estimating in nite horizon ruin probabilities in insurance risk processes with heavy-tailed claims can be transformed into the same framework. It is well-k...
متن کاملError Bounds for Perturbing Nonexponential Queues
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...
متن کاملA sample path analysis of M/GI/1 queues with workload restrictions
A simple random time change is used to analyze M/GI/1 queues with workload restrictions. The types of restrictions considered include workload bounds and rejection of jobs whose waiting times exceed a (possibly random) threshold. Load dependent service rates and vacations are also allowed and in each case the steady state distribution of the workload process for the system with workload restric...
متن کاملOn the Relaxation Time for Single Server Queues
This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...
متن کاملA note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates. c © 2003 Elsevier B.V. All rights reserved.
متن کامل